Closure-based constraints in formal concept analysis
نویسندگان
چکیده
منابع مشابه
Formal Concept Analysis with Constraints by Closure Operators
The paper presents a general method of imposing constraints in formal concept analysis of tabular data describing objects and their attributes. The constraints represent a user-defined requirements which are supplied along with the input data table. The main effect is to filterout outputs of the analysis (conceptual clusters and if-then rules) which are not compatible with the constraint, in a ...
متن کاملMembership Constraints in Formal Concept Analysis
Formal Concept Analysis (FCA) is a prominent field of applied mathematics using object-attribute relationships to define formal concepts – groups of objects with common attributes – which can be ordered into conceptual hierarchies, so-called concept lattices. We consider the problem of satisfiability of membership constraints, i.e., to determine if a formal concept exists whose object and attri...
متن کاملFormal Concept Analysis Based Clustering
Formal concept analysis (FCA) is a branch of applied mathematics with roots in lattice theory (Wille, 1982; Ganter & Wille, 1999). It deals with the notion of a concept in a given universe, which it calls context. For example, consider the context of transactions at a grocery store where each transaction consists of the items bought together. A concept here is a pair of two sets (A, B). A is th...
متن کاملOntology-based concept similarity in Formal Concept Analysis
Both domain ontologies and Formal Concept Analysis (FCA) aim at modeling concepts, although with different purposes. In the literature, a promising research area concerns the role of FCA in ontology engineering, in particular, in supporting the critical task of reusing independently developed domain ontologies. With this regard, the possibility of evaluating concept similarity is acquiring an i...
متن کاملQuery-based Biclustering using Formal Concept Analysis
Biclustering methods have proven to be critical tools in the exploratory analysis of high-dimensional data including information networks, microarray experiments, and bag of words data. However, most biclustering methods fail to answer specific questions of interest and do not incorporate prior knowledge and expertise from the user. To this end, query-based biclustering algorithms that are rece...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2013
ISSN: 0166-218X
DOI: 10.1016/j.dam.2013.02.029